- solvable games
- разрешимые игры
English-Russian dictionary of computer science. 2015.
solvable games
Смотреть что такое "solvable games" в других словарях:
Max-dominated strategy — In game theory a max dominated strategy is a strategy which is not a best response to any strategy profile of the other players. This is an extension to the notion of strictly dominated strategies, which are obviously max dominated as well.… … Wikipedia
Klondike (solitaire) — Klondike is a solitaire card game. Many people refer to Klondike as solitaire .RulesTaking a standard 52 card deck of playing cards (without Jokers) one upturned card is dealt on the left of the playing area, then six downturned cards (from left… … Wikipedia
Solved game — A two player game can be solved on several levels: [V. Allis, Searching for Solutions in Games and Artificial Intelligence. PhD thesis, Department of ComputerScience, University of Limburg, 1994. Online:… … Wikipedia
operations research — the analysis, usually involving mathematical treatment, of a process, problem, or operation to determine its purpose and effectiveness and to gain maximum efficiency. [1940 45, Amer.] * * * Application of scientific methods to management and… … Universalium
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Simple Simon (solitaire) — Simple Simon is a Solitaire card game played with a regular 52 cards deck (4suits of 13 cards each without Jokers). It became somewhat popular being featured in some computerized collections of Solitaire card games, but itsorigins possibly… … Wikipedia
Countdown (game show) — Countdown Title card since 2009. Genre Game show Created by Armand Jammot … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Peg solitaire — The Princess of Soubise playing solitaire, 1697 Peg solitaire is a board game for one player involving movement of pegs on a board with holes. Some sets use marbles in a board with indentations. The game is known simply as Solitaire in the United … Wikipedia
EXPTIME — EXP redirects here; for other uses, see exp. In computational complexity theory, the complexity class EXPTIME (sometimes called EXP) is the set of all decision problems solvable by a deterministic Turing machine in O(2 p ( n )) time, where p ( n… … Wikipedia
Tower of Hanoi — The Tower of Hanoi or Towers of Hanoi (also known as The Towers of Bramha) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks neatly … Wikipedia
